- Home
- Search Results
- Page 1 of 1
Search for: All records
-
Total Resources2
- Resource Type
-
0000000002000000
- More
- Availability
-
20
- Author / Contributor
- Filter by Author / Creator
-
-
Carbajal, Yvette (1)
-
Davidov, Nathan (1)
-
Hernandez, Amanda (1)
-
Hernandez, Amanda L. (1)
-
Holt, Rebecca (1)
-
Jian, Justin (1)
-
LeSauter, Joseph (1)
-
Mckenna, Patrick (1)
-
Medlin, Karen (1)
-
Mojumder, Roadra (1)
-
Owen, Megan (1)
-
Quijano, Andrew (1)
-
Rimu, Kania (1)
-
Rodriguez, Amanda (1)
-
Silver, Rae (1)
-
St.John, Katherine (1)
-
Taub, Alana (1)
-
Thai, Katherine (1)
-
Uraga, Meliza (1)
-
Yao, Yifan (1)
-
- Filter by Editor
-
-
null (2)
-
& Spizer, S. M. (0)
-
& . Spizer, S. (0)
-
& Ahn, J. (0)
-
& Bateiha, S. (0)
-
& Bosch, N. (0)
-
& Brennan K. (0)
-
& Brennan, K. (0)
-
& Chen, B. (0)
-
& Chen, Bodong (0)
-
& Drown, S. (0)
-
& Ferretti, F. (0)
-
& Higgins, A. (0)
-
& J. Peters (0)
-
& Kali, Y. (0)
-
& Ruiz-Arias, P.M. (0)
-
& S. Spitzer (0)
-
& Sahin. I. (0)
-
& Spitzer, S. (0)
-
& Spitzer, S.M. (0)
-
-
Have feedback or suggestions for a way to improve these results?
!
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Davidov, Nathan; Hernandez, Amanda; Mckenna, Patrick; Medlin, Karen; Jian, Justin; Mojumder, Roadra; Owen, Megan; Quijano, Andrew; Rodriguez, Amanda; St.John, Katherine; et al (, IEEE/ACM Transactions on Computational Biology and Bioinformatics)null (Ed.)Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of Francis, Semple, and Steel about the complexity of determining how far a phylogenetic network is from being tree-based, including non-binary phylogenetic networks. We show that finding a phylogenetic tree covering the maximum number of nodes in a phylogenetic network can be computed in polynomial time via an encoding into a minimum-cost flow problem.more » « less
An official website of the United States government
